FFT algorithms and their adaptation to parallel processing
نویسندگان
چکیده
منابع مشابه
FFT Algorithms for SIMD Parallel Processing Systems
SIMD (single instruction stream-multiple data stream) algorithms for one-and two-dimensional discrete Fourier transforms are presented. Parallel structurings of algorithms for efficient computation for a variety of machine size/problem size combinations are presented and analyzed. Through these algorithms, techniques for exploiting relationships between problem size and machine size are demonst...
متن کاملImplementation and performance evaluation of parallel FFT algorithms
Fast Fourier Transform (FFT) algorithms are widely used in many areas of science and engineering. Some of the most widely known FFT algorithms are Radix-2 algorithm, Radix-4 algorithm, Split Radix algorithm, Fast Hartley transformation based algorithm and Quick Fourier transform. In this paper, the first three algorithms listed are implemented in the sequential and MPI (message passing interfac...
متن کاملFFT Algorithms
The DFT usually arises as an approximation to the continuous Fourier transform when functions are sampled at discrete intervals in space or time. The naive evaluation of the discrete Fourier transform is a matrix-vector multiplication W~g, and would take O(N) operations for N data-points. The general principle of the Fast Fourier Transform algorithms is to use a divide-and-conquer strategy to f...
متن کاملParallel Processing Letters Fast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p)logn) and an improved algorithm with run time O(n/p+logn loglog(n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If preex summation is supported at the instruction level, the run ti...
متن کاملParallel FFT-Hashing
We propose two families of scalable hash functions for collision–resistant hashing that are highly parallel and based on the generalized fast Fourier transform (FFT). FFT–hashing is based on multipermutations. This is a basic cryptographic primitive for perfect generation of diffusion and confusion which generalizes the boxes of the classic FFT. The slower FFT–hash functions iterate a compressi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10086-1